A proof-centric approach to mathematical assistants
نویسندگان
چکیده
We present an approach to mathematical assistants which uses readable, executable proof scripts as the central language for interaction. We examine an implementation that combines the Isar language, the Isabelle theorem prover and the IsaPlanner proof planner. We argue that this synergy provides a flexible environment for the exploration, certification, and presentation of mathematical proof.
منابع مشابه
A Real Semantic Web for Mathematics Deserves a Real Semantics
Mathematical documents, and their instrumentation by computers, have rich structure at the layers of presentation, metadata and semantics, as objects in a system for formal mathematical logic. Semantic Web tools [2] support the first two of these, with little, if any, contribution to the third, while Proof Assistants [17] instrument the third layer, typically with bespoke approaches to the firs...
متن کاملFormal Proof Sketches
We define the notion of formal proof sketch for the mathematical language Mizar. We show by examples that formal proof sketches are very close to informal mathematical proofs. We discuss some ways in which formal proof sketches might be used to improve mathematical proof assistants.
متن کاملMatching Concepts across HOL Libraries
Many proof assistant libraries contain formalizations of the same mathematical concepts. The concepts are often introduced (defined) in different ways, but the properties that they have, and are in turn formalized, are the same. For the basic concepts, like natural numbers, matching them between libraries is often straightforward, because of mathematical naming conventions. However, for more ad...
متن کاملDevelopments in Formal Proofs
A proof assistant is interactive computer software that humans use to prepare scripts of mathematical proofs. These proof scripts can be parsed and verified directly from the fundamental rules of logic and the foundational axioms of mathematics. The technology underlying proof assistants and formal proofs has been under development for decades and grew out of efforts in the early twentieth cent...
متن کاملShort Introduction by Example to Coq and Formalising ZF ⊆ ZFε in Coq
Proof assistants are computer programs that help mathematicians to prove theorems and to formally verify the correctness of proofs. Proof assistants are nowadays one of the more exciting areas in the intersection of mathematical logic and computer science. For example, one particularly exciting achievement is the formal verification of the proof of the four colour theorem using the proof assist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Logic
دوره 4 شماره
صفحات -
تاریخ انتشار 2006